Regulatory motif finding by logic regression
نویسندگان
چکیده
منابع مشابه
Regulatory motif finding by logic regression
MOTIVATION Multiple transcription factors coordinately control transcriptional regulation of genes in eukaryotes. Although many computational methods consider the identification of individual transcription factor binding sites (TFBSs), very few focus on the interactions between these sites. We consider finding TFBSs and their context specific interactions using microarray gene expression data. ...
متن کامل6.895 Project: Combinatorial Regulatory Motif Finding
In this class, we have seen many algorithms for regulatory motif finding. In general, these algorithms fall into two categories – probabilistic and combinatorial. Probabilistic solutions, such as expectation-maximization and Gibbs sampling have had much empirical success, but they are not well understood from a theoretical standpoint. For combinatorial solutions, either the algorithms use exhau...
متن کاملFinding regulatory sequences in DNA: motif discovery
The purpose of motif discovery as discussed here is to find binding sites of DNA binding regulators. We assume that the binding sites are short segments of DNA, not necessarily contiguous, to which a specific (family of) transcription factors can bind. While such sites may appear in genic as well as intergenic regions, we focus here on finding binding sites only in the promoter region of each ...
متن کاملExtension of Logic regression to Longitudinal data: Transition Logic Regression
Logic regression is a generalized regression and classification method that is able to make Boolean combinations as new predictive variables from the original binary variables. Logic regression was introduced for case control or cohort study with independent observations. Although in various studies, correlated observations occur due to different reasons, logic regression have not been studi...
متن کاملParallel Network Motif Finding
Network motifs are over-represented patterns within a network, and signify the fundamental building blocks of that network. The process of finding network motifs is closely related to the traditional subgraph isomorphism problem in computer science, which finds instances of a particular subgraph in a graph. This problem has been proven NP-complete, and thus even for relatively small subgraphs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bth333